Decomposable trees: a polynomial algorithm fortripodes
نویسندگان
چکیده
In this article, we deal with graphs modelling interconnection networks of parallel systems (parallel computers, networks of workstations,..). We want to share the nodes of such a network between many users, each one needing a given number of nodes. Thus, a graph G with N vertices is said to be decomposable if for each set fn 1 We show that determining if a given tripode (three disjoint chains connected by one extremity to a same new vertex) is decomposable can be done by a polynomial algorithm.
منابع مشابه
A degree bound on decomposable trees
A n-vertex graph is said to be decomposable if for any partition (λ1, . . . , λp) of the integer n, there exists a sequence (V1, . . . , Vp) of connected vertex-disjoint subgraphs with |Vi| = λi. In this paper, we focus on decomposable trees. We show that a decomposable tree has degree at most 4. Moreover, each degree-4 vertex of a decomposable tree is adjacent to a leaf. This leads to a polyno...
متن کاملGenerating Junction Trees of Decomposable Graphs with the Christmas Tree Algorithm
The junction tree representation provides an attractive structural property for organizing a decomposable graph. In this study, we present a novel stochastic algorithm which we call the Christmas tree algorithm for building of junction trees sequentially by adding one node at a time to the underlying decomposable graph. The algorithm has two important theoretical properties. Firstly, every junc...
متن کاملThe number of decomposable univariate polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملThe Number of Decomposable Univariate Polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملReconstruction of Decomposable Discrete Sets from Four Projections
In this paper we introduce the class of decomposable discrete sets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class S ′ 8 of hv-convex 8but not 4-connected discrete sets which was studied in [3]. As a consequence we also get that the reconstruction fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 119 شماره
صفحات -
تاریخ انتشار 2002